Optimizing matrix stability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Matrix Stability

Given an affine subspace of square matrices, we consider the problem of minimizing the spectral abscissa (the largest real part of an eigenvalue). We give an example whose optimal solution has Jordan form consisting of a single Jordan block, and we show, using nonlipschitz variational analysis, that this behaviour persists under arbitrary small perturbations to the example. Thus although matric...

متن کامل

An Optimizing Matrix Element Generator

We sketch the architecture of O’Mega, a new optimizing compiler for tree amplitudes in quantum field theory, and briefly describe its usage. O’Mega generates the most efficient code currently available for scattering amplitudes for many polarized particles in the Standard Model and its extensions. e-mail: [email protected] e-mail: [email protected] e-mail: [email protected]

متن کامل

Euclidean Partitions Optimizing Noise Stability

The Standard Simplex Conjecture of Isaksson and Mossel [12] asks for the partition {Ai}i=1 of R into k ≤ n + 1 pieces of equal Gaussian measure of optimal noise stability. That is, for ρ > 0, we maximize k ∑

متن کامل

Optimizing protein stability in vivo.

Identifying mutations that stabilize proteins is challenging because most substitutions are destabilizing. In addition to being of immense practical utility, the ability to evolve protein stability in vivo may indicate how evolution has formed today's protein sequences. Here we describe a genetic selection that directly links the in vivo stability of proteins to antibiotic resistance. It allows...

متن کامل

Optimizing Matrix-matrix Multiplication for an Embedded Vliw Processor

The optimization of matrix-matrix multiplication (MMM) performance has been well studied on conventional general-purpose processors like the Intel Pentium 4. Fast algorithms, such as those in the Goto and ATLAS BLAS libraries, exploit common microarchitectural features including superscalar execution and the cache and TLB hierarchy to achieve near-peak performance. However, the microarchitectur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2000

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-00-05985-2